#
# @lc app=leetcode.cn id=94 lang=python3
#
# [94] 二叉树的中序遍历
#

# @lc code=start
# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    
    outList = []
    def inorderTraversal(self, root: TreeNode) -> List[int]:
<<<<<<< HEAD
    
        Solution.outList = []
        if root != None:
            self.midOrder(root)

        return Solution.outList    
        
    def midOrder(self,treeNode):

        if treeNode.left != None:
            self.midOrder(treeNode.left)
        
        Solution.outList.append(treeNode.val)
        
        if treeNode.right != None:
            self.midOrder(treeNode.right)
    
   
    
=======
        
        # def midOrder(treeNode):

        #     if treeNode.left != None:
        #         midOrder(treeNode.left)
            
        #     outList.append(treeNode.val)
            
        #     if treeNode.right != None:
        #         midOrder(treeNode.right)
        # outList = []
       
        # if root != None:
        #     midOrder(root)

        # return outList
>>>>>>> fd02c5b7a064192517ae7809596577062c09d509
        
        outList = []
        nodeList = []
        nodeList.append(root)
        
        while nodeList != []:
            tempNode = nodeList.pop()
            
        
                  
        
# @lc code=end